Mathematical Programming Manuscript No

نویسنده

  • B. Fortz
چکیده

Facets for the polyhedron of two-connected networks with bounded rings Abstract. We study the polyhedron associated with a network design problem which consists in determining at minimum cost a two-connected network such that the shortest cycle to which each edge belongs (a \ring") does not exceed a given length K. We present here a new formulation of the problem and derive facet results for diierent classes of valid inequalities.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards Supply Chain Planning Integration: Uncertainty Analysis Using Fuzzy Mathematical Programming Approach in a Plastic Forming Company

Affected by globalization and increased complexity, supply chain managers have learned about the importance of Sales and Operations Planning (S&OP). However, in large scale supply chains, S&OP has received little attention, by both academics and practitioners. The purpose of this manuscript is to investigate the advantages of S&OP process using a mathematical modeling approach in a large scale ...

متن کامل

Mathematical Programming Manuscript No. Smooth Exact Penalty and Barrier Functions for Nonsmooth Optimization

For constrained nonsmooth optimization problems, continuously diierentiable penalty functions and barrier functions are given. They are proved exact in the sense that under some nondegeneracy assumption, local optimizers of a nonlinear program are also optimizers of the associated penalty or barrier function. This is achieved by augmenting the dimension of the program by a variable that control...

متن کامل

Comparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints

The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...

متن کامل

Basic Mathematical Programming Models for Capacity Allocation in Mesh-based Survivable Networks

Designing a low cost, survivable, telecommunications network is an extremely complicated process. Most commercial products available to help with this process are based on simulation and/or proprietary heuristics. However, there is a growing consensus that mathematical programming belongs in the designer’s “toolkit.” Easyto-use modeling languages coupled with powerful optimization solvers have ...

متن کامل

Mathematical solution of multilevel fractional programming problem with fuzzy goal programming approach

In this paper, we show a procedure for solving multilevel fractional programming problems in a large hierarchical decentralized organization using fuzzy goal programming approach. In the proposed method, the tolerance membership functions for the fuzzily described numerator and denominator part of the objective functions of all levels as well as the control vectors of the higher level decision ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999